|
In mathematical analysis and applications, multidimensional transforms are used to analyze the frequency content of signals in a domain of two or more dimensions. == Multidimensional Fourier transform == One of the more popular multidimensional transforms is the Fourier transform, which converts a signal from a time/space domain representation to a frequency domain representation.〔Smith,W. Handbook of Real-Time Fast Fourier Transforms:Algorithms to Product Testing, Wiley_IEEE Press, edition 1, pages 73–80, 1995〕 The discrete-domain multidimensional Fourier transform (FT) can be computed as follows: : where ''F'' stands for the multidimensional Fourier transform, ''m'' stands for multidimensional dimension. Define ''f'' as a multidimensional discrete-domain signal. The inverse multidimensional Fourier transform is given by : The multidimensional Fourier transform for continuous-domain signals is defined as follows:〔 : A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. An FFT computes the DFT and produces exactly the same result as evaluating the DFT definition directly; the only difference is that an FFT is much faster. (In the presence of round-off error, many FFT algorithms are also much more accurate than evaluating the DFT definition directly).There are many different FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory. See more in FFT. The multidimensional discrete Fourier transform (DFT) is a sampled version of the discrete-domain FT by evaluating it at sample frequencies that are uniformly spaced.〔Dudgeon and Mersereau, Multidimensional Digital Signal Processing,2nd edition,1995〕 The DFT is given by: : for , . The inverse multidimensional DFT equation is : for . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Multidimensional transform」の詳細全文を読む スポンサード リンク
|